Termination for direct sums of left-linear complete term rewriting systems
نویسندگان
چکیده
منابع مشابه
Polygraphs for termination of left-linear term rewriting systems
We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic circuits. We translate the considered TRS into a polygraph of minimal size whose termination is proven with a polygraphic interpretation, then we get back the property on the TRS. We recall Yves Lafont’s general translation ...
متن کاملTermination for the Direct Sum of left-Linear Term Rewriting Systems -Preliminary Draft-
1. I n t r o d u c t i o n An important concern in building algebraic specifications is their hierarchical or modular structure. The same holds for term rewriting systems [1] which can be viewed as implementations of equational algebraic specifications. Specifically, it is of obvious interest to determine which *This paper is an abbreviated version of the IEICE technical report COMP88-30, July ...
متن کاملTermination of linear bounded term rewriting systems
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bounded uniform termination, the k-bounded termination, the inverse k-bounded uniform, and the inverse kbounded problems are decidable. The k-bounded class (BO(k)) is, by definition, the set of linear systems for which e...
متن کاملPersistence of Termination for Right-Linear Overlay Term Rewriting Systems
A property is called persistent if for any manysorted term rewriting system , has the property if and only if term rewriting system , which results from by omitting its sort information, has the property . In this paper, we show that termination is persistent for right-linear overlay term rewriting systems and we give the example as application of this result. Furthermore we obtain that termina...
متن کاملOn Termination of the Direct Sum of Term-Rewriting Systems
To cite this version: Michaël Rusinowitch. On termination of the direct sum of term rewriting systems. HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouvert...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1995
ISSN: 0004-5411,1557-735X
DOI: 10.1145/227683.227689